Abstract solvers for Dung's argumentation frameworks

نویسندگان

  • Rémi Brochenin
  • Thomas Linsbichler
  • Marco Maratea
  • Johannes Peter Wallner
  • Stefan Woltran
چکیده

Solvers for Dung’s Argumentation

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

"Minimal defence": a refinement of the preferred semantics for argumentation frameworks

Dung's abstract framework for argumenta-tion enables a study of the interactions between arguments based solely on an " attack " binary relation on the set of arguments. Various ways to solve conflicts between contradictory pieces of information have been proposed in the context of argumentation, non-monotonic reasoning or logic programming, and can be captured by appropriate semantics within D...

متن کامل

The matrices of argumentation frameworks

We introduce matrix and its block to the Dung's theory of argumentation frameworks. It is showed that each argumentation framework has a matrix representation, and the common extension-based semantics of argumenta-tion framework can be characterized by blocks of matrix and their relations. In contrast with traditional method of directed graph, the matrix way has the advantage of computability. ...

متن کامل

A Generalization of Dung's Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments

One of the most widely studied systems of argumentation is the one described by Dung in a paper from 1995. Unfortunately, this framework does not allow for joint attacks on arguments, which we argue must be required of any truly abstract argumentation framework. A few frameworks can be said to allow for such interactions among arguments, but for various reasons we believe that these are inadequ...

متن کامل

A Structural Benchmark for Logical Argumentation Frameworks

This paper proposes a practically-oriented benchmark suite for computational argumentation. We instantiate abstract argumentation frameworks with existential rules, a language widely used in Semantic Web applications and provide a generator of such instantiated graphs. We analyse performance of argumentation solvers on these benchmarks.

متن کامل

A matrix approach for computing extensions of argumentation frameworks

The matrices and their sub-blocks are introduced into the study of determining various extensions in the sense of Dung's theory of argumentation frameworks. It is showed that each argumentation framework has its matrix representations, and the core semantics defined by Dung can be characterized by specific sub-blocks of the matrix. Furthermore, the elementary permutations of a matrix are employ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Argument & Computation

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2015